منابع مشابه
Domain Decomposition vs. Concurrent Multigrid Domain Decomposition vs. Concurrent Multigrid 1
We compare the performance on a concurrent computer of two domaindecomposition methods and a full-multigrid method for solving the Poisson equation on a square. Independent of the granularity of the computation, domain decomposition is almost always signi cantly slower than multigrid. Our largest computations use a multicomputer with 128 nodes to solve a problem on a 2048 2048 grid. In these co...
متن کاملMultigrid and Domain Decomposition Methods for Electrostatics Problems
We consider multigrid and domain decomposition methods for the numerical solution of electrostatics problems arising in biophysics. We compare multigrid methods designed for discontinuous coefficients with domain decomposition methods, including comparisons of standard multigrid methods, algebraic multigrid methods, additive and multiplicative Schwarz domain decomposition methods, and accelerat...
متن کاملOverlapping Domain Decomposition and Multigrid Methods for Inverse Problems
Our emphasis is on the numerical treatment of discontinuous coefficient and efficiency of the numerical methods. It is well known that such an inverse problem is illposed. Its numerical solution often suffers from undesirable numerical oscillation and very slow convergence. When the coefficient is smooth, successful numerical methods have been developed in [5] [7]. When the coefficient has larg...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملA Domain Decomposition for a Parallel Adaptive Meshing Algorithm
We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication , makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. In [4, 5], we introduced a gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2016.07.030